Temporal Query Processing Using Spatially-Partitioned Method
نویسندگان
چکیده
In this paper, we propose a general spatiallypartitioned temporal operation model, called 3D-TOM, and partition-based join algorithms for various types of temporal join in the proposed model. The temporal operators addressed in this paper include overlap, precede, follow, and equal. Some factors which a ect the performance of the proposed method are also discussed.
منابع مشابه
Temporal Query Processing using Spatially - Partitioned
In this paper, we propose a general spatially-partitioned temporal operation model, called 3D-TOM, and partition-based join algorithms for various types of temporal join in the proposed model. The temporal operators addressed in this paper include overlap, precede, follow, and equal. Some factors which aaect the performance of the proposed method are also discussed .
متن کاملA Comparison of Indexed Temporal Joins
We examine temporal joins in the presence of indexing schemes. Utilizing an index when processing join queries is especially advantageous if the join predicates involve only a portion of the temporal relations. This is a novel problem since temporal indices have various characteristics that can affect join processing drastically. For example, temporal indices commonly introduce record copies to...
متن کاملSequential Processing for Content-Based Retrieval of Composite Objects
It is becoming increasingly important for multimedia databases to provide capabilities for content-based retrieval of composite objects. Composite objects consist of several simple objects which have feature, spatial, temporal, semantic attributes, and spatial and temporal relationships between them. A content-based composite object query is satis ed by evaluating a program of content-based rul...
متن کاملEffect of Inverted Index Partitioning Schemes on Performance of Query Processing in Parallel Text Retrieval Systems
Shared-nothing, parallel text retrieval systems require an inverted index, representing a document collection, to be partitioned among a number of processors. In general, the index can be partitioned based on either the terms or documents in the collection, and the way the partitioning is done greatly affects the query processing performance of the parallel system. In this work, we investigate ...
متن کاملEfficient Temporal Keyword Queries over Versioned Text
Modern text analytics applications operate on large volumes of temporal text data such as Web archives, newspaper archives, blogs, wikis, and micro-blogs. In these settings, searching and mining needs to use constraints on the time dimension in addition to keyword constraints. A natural approach to address such queries is an inverted index whose entries are enriched with valid-time intervals. I...
متن کامل